A Shrink Wrapping Approach to Remeshing Polygonal Surfaces

نویسندگان

  • Leif Kobbelt
  • Jens Vorsatz
  • Ulf Labsik
  • Hans-Peter Seidel
چکیده

Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms in the context of multiresolution representation and modeling can be performed much more efficiently and robustly if the underlying surface tesselations have the special subdivision connectivity. In this paper, we propose a new algorithm for converting a given unstructured triangle mesh into one having subdivision connectivity. The basic idea is to simulate the shrink wrapping process by adapting the deformable surface technique known from image processing. The resulting algorithm generates subdivision connectivity meshes whose base meshes only have a very small number of triangles. The iterative optimization process that distributes the mesh vertices over the given surface geometry guarantees low local distortion of the triangular faces. We show several examples and applications including the progressive transmission of subdivision surfaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preparation of Control Space for Remeshing of Polygonal Surfaces

The subject of the article concerns the issues of remeshing, transforming a polygonal mesh into a triangular mesh adapted to its surface. From the initial polygonal mesh, the curvature of surface and boundary is retrieved and used to calculate a metric tensor varying in three-dimensional space. In the proposed approach, the curvature is computed using local approximation of surfaces and curves ...

متن کامل

Remeshing triangulated surfaces with optimal parameterizations

The use of polygonal meshes, especially triangle meshes, is manifold, but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitrarily structured mesh. The process of replacing an arbitrarily structured mesh by a structured one is called remeshing and the most important class of structered meshes are triangle meshes with subdivision connectivity...

متن کامل

Shrink-Wrapping trajectories for Linear Programming

Hyperbolic Programming (HP) –minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone– is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Sh...

متن کامل

The Method of Shrink Wrapping For the Validated Solution of ODEs

In this note, we outline one method to perform shrink wrapping to eliminate the remainder term of the Taylor model integration of ODEs. We point out that there are many variants of this approach, and while the one shown here is perhaps the simplest one to understand, it is not necessarily the optimal choice. More about other possibilities at the end of the section. After the n-th step of the in...

متن کامل

Quadrilateral Remeshing

The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitrarily shaped mesh. The process of replacing an arbitrary mesh by a structured one is called remeshing. Triangle meshes with subdivision connectivity are an important class of structured meshes and have been studied thor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1999